Network flow interdiction on planar graphs
نویسنده
چکیده
منابع مشابه
Extensions to Network Flow Interdiction on Planar Graphs
Network flow interdiction analysis studies by how much the value of a maximum flow in a network can be diminished by removing components of the network constrained to some budget. Although this problem is strongly NP-complete on general networks, pseudo-polynomial algorithms were found for planar networks with a single source and a single sink and without the possibility to remove vertices. In ...
متن کاملInterdiction Problems on Planar Graphs
We introduce approximation algorithms and strong NP-completeness results for interdiction problems on planar graphs. Interdiction problems are leader-follower games in which the leader is allowed to delete a certain number of edges from the graph in order to maximally impede the follower, who is trying to solve an optimization problem on the impeded graph. We give a multiplicative (1+ǫ)-approxi...
متن کاملA Note on the Integrality Gap in the Nodal Interdiction Problem
In the maximum flow network interdiction problem, an attacker attempts to minimize the maximum flow by interdicting flow on the arcs of network. In this paper, our focus is on the nodal interdiction for network instead of the arc interdiction. Two path inequalities for the node-only interdiction problem are represented. It has been proved that the integrality gap of relaxation of the maximum fl...
متن کاملMarkovian Network Interdiction and the Four Color Theorem
The Unreactive Markovian Evader Interdiction Problem (UME) asks to optimally place sensors on a network to detect Markovian motion by one or more evaders . It was previously proved that nding the optimal sensor placement is NP-hard if the number of evaders is unbounded. Here we show that the problem is NP-hard with just 2 evaders using a connection to coloring of planar graphs. The results sugg...
متن کاملHardness and approximation for network flow interdiction
In the Network Flow Interdiction problem an adversary attacks a network in order to minimize the maximum s-t-flow. Very little is known about the approximatibility of this problem despite decades of interest in it. We present the first approximation hardness, showing that Network Flow Interdiction and several of its variants cannot be much easier to approximate than Densest k-Subgraph. In parti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 158 شماره
صفحات -
تاریخ انتشار 2010